/********************************
 * Robinson Matrix Algorithm
 *
 * Copyright (C) 2009 CNRS
 * Author : Florent AVELLANEDA, Eugen CEPOI
 * 
 *
 * All rights reserved.
 *
 *   This file is part of Robinson Matrix Algorithm.
 *
 *   Robinson Matrix Algorithm is free software: you can redistribute it and/or modify
 *   it under the terms of the GNU General Public License as published by
 *   the Free Software Foundation, either version 3 of the License, or
 *   (at your option) any later version.
 *
 *   Robinson Matrix Algorithm is distributed in the hope that it will be useful,
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *   GNU General Public License for more details.
 *
 *   You should have received a copy of the GNU General Public License
 *   along with Robinson Matrix Algorithm.  If not, see <http://www.gnu.org/licenses/>.
 *
 ***********************************************************************************/
#ifndef TEST_F92F4UJF

#define TEST_F92F4UJF

#include <vector>

#include "Matrix.h"

bool test();
double optimalRobinsonMatrix(const Matrix &m);
double approximation(Matrix m, std::vector<unsigned int> &order);
double optimalRobinsonMatrixPrint(const Matrix &m);
/**
 * @brief generaters a dissimilarity matrix based on a knwon robinsonian matrix, a delta, and
 *  the permutations
 * @param robinsonMatrix - the robinsonian matrix
 * @param delta - the maximal distances beetween the dissimilarity matrix and the robinson matrix
 * @param permutations - must have size 0 or equal to the size of m
 * @return the dissimilarity matrix
 */

Matrix generateTestMatrix( const Matrix &robinsonMatrix, double delta );
Matrix generateTestMatrix( const Matrix &robinsonMatrix, std::vector<unsigned int> &permutations, double delta = 0 );

#endif /* end of include guard: TEST_F92F4UJF */
